Kibble-Zurek mechanism in simulated annealing and quantum annealing
نویسندگان
چکیده
منابع مشابه
Kibble-Zurek mechanism in simulated annealing and quantum annealing
We study errors of quantum annealing and simulated annealing to highlight better performance of quantum annealing over simulated annealing. Quantum annealing and simulated annealing perform optimization through a quantum adiabatic evolution and a quasi-static evolution respectively. In both methods, dynamics across a phase transition plays a crucial role. The Kibble-Zurek mechanism is known as ...
متن کاملQuantum Simulated Annealing
We develop a quantum algorithm to solve combinatorial optimization problems through quantum simulation of a classical annealing process. Our algorithm combines techniques from quantum walks, quantum phase estimation, and quantum Zeno effect. It can be viewed as a quantum analogue of the discrete-time Markov chain Monte Carlo implementation of classical simulated annealing. Our implementation re...
متن کاملQuantum Simulated Annealing Algorithm
Received on:2/6/2009 Accepted on:1/4/2010 Abstract Simulated annealing (SA) has been considered as a good tool for search and optimization problems which represent the abstraction of obtaining the crystalline structure through a physical process. This algorithm works sequentially that the current state will produce only one next state. That will make the search to be slower and the important dr...
متن کاملKibble-Zurek mechanism in colloidal monolayers.
The Kibble-Zurek mechanism describes the evolution of topological defect structures like domain walls, strings, and monopoles when a system is driven through a second-order phase transition. The model is used on very different scales like the Higgs field in the early universe or quantum fluids in condensed matter systems. A defect structure naturally arises during cooling if separated regions a...
متن کاملOn Simulated Annealing and Nested Annealing
Simulated Annealing is a family of randomized algorithms used to solve many combinatorial optimization problems. In practice they have been applied to solve some presumably hard (e.g., NP-complete) problems. The level of performance obtained has been promising [5, 2, 6, 14]. The success of this heuristic technique has motivated analysis of this algorithm from a theoretical point of view. In par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2011
ISSN: 1742-6596
DOI: 10.1088/1742-6596/302/1/012046